github.com/andybalholm/brotli/matchfinder.absoluteMatch.Match (field)

25 uses

	github.com/andybalholm/brotli/matchfinder (current package)
		bargain1.go#L94: 			distanceCost = float32(bits.Len(uint(m.Start - m.Match)))
		bargain1.go#L104: 				distance: uint32(m.Start - m.Match),
		bargain1.go#L176: 					m.Match += delta
		bargain2.go#L105: 			distanceCost = float32(bits.Len(uint(m.Start - m.Match)))
		bargain2.go#L115: 				distance: uint32(m.Start - m.Match),
		bargain2.go#L192: 					m.Match += delta
		bargain2.go#L208: 					m.Match += delta
		bargain3.go#L111: 			distanceCost = float32(bits.Len(uint(m.Start - m.Match)))
		bargain3.go#L121: 				distance: uint32(m.Start - m.Match),
		bargain3.go#L202: 					m.Match += delta
		bargain3.go#L218: 					m.Match += delta
		bargain3.go#L234: 					m.Match += delta
		emitter.go#L15: 	Match int
		emitter.go#L31: 		Distance:  m.Start - m.Match,
		m4.go#L60: 	return (m.End-m.Start)*256 + (bits.LeadingZeros32(uint32(m.Start-m.Match))-32)*q.DistanceBitCost
		m4.go#L245: 						if pos <= matches[2].Match {
		m4.go#L249: 							matches[2].Match = pos
		m4.go#L337: 		Match: candidate,
		pathfinder.go#L158: 			prevDistance := prevMatch.Start - prevMatch.Match
		pathfinder.go#L250: 			if m.Start-m.Match != prevDistance {
		pathfinder.go#L251: 				matchCost += float32(bits.Len(uint(m.Start - m.Match)))
		pathfinder.go#L264: 						distance: uint32(m.Start - m.Match),
		pathfinder.go#L274: 			!(arrivedHere.length != 0 && arrivedHere.distance == uint32(pending.Start-pending.Match)) {
		pathfinder.go#L275: 			matchCost := baseMatchCost + float32(bits.Len(uint(pending.Start-pending.Match)))
		pathfinder.go#L287: 						distance: uint32(pending.Start - pending.Match),